Higher-order unification revisited: Complete sets of transformations
نویسندگان
چکیده
منابع مشابه
Higher-Order Unification Revisited: Complete Sets of Transformations
In this paper, we reexamine the problem of general higher-order unification and develop an approach based on the method of transformations on systems of terms which has its roots in Herbrand’s thesis, and which was developed by Martelli and Montanari in the context of first-order unification. This method provides an abstract and mathematically elegant means of analyzing the invariant properties...
متن کاملComplete Sets of Transformations for General E-Unification
This paper is concerned with E-unification in arbitrary equational theories. We extend the method of transformations on systems of terms, developed by Martelli-Montanari for standard unification, to Eunification by giving two sets of transformations, BT and T, which are proved to be sound and complete in the sense that a complete set of E-unifiers for any equational theory E can be enumerated b...
متن کاملOperads of higher transformations for globular sets and for higher magmas
In this article we discuss examples of fractal $omega$-operads. Thus we show that there is an $omega$-operadic approach to explain existence of the globular set of globular setsfootnote{Globular sets are also called $omega$-graphs by the French School.}, the reflexive globular set of reflexive globular sets, the $omega$-magma of $omega$-magmas, and also the reflexive $omega$-magma ...
متن کاملOrder-sorted Equational Unification Revisited
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of int...
متن کاملHigher Order Context Transformations
The context transformation and generalized context transformation methods, we introduced recently, were able to reduce zero order entropy by exchanging digrams, and as a consequence, they were removing mutual information between consecutive symbols of the input message. These transformations were intended to be used as a preprocessor for zero-order entropy coding algorithms like Arithmetic or H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1989
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(89)80023-9